Circuit Clustering and Its Effects on a Multi-way Circuit Partitioning Heuristic
نویسندگان
چکیده
We propose a clustering heuristic based on circuit con-nectivity which produces a large number of small clusters of nearly equal size. We investigate a two phase partitioning heuristic. Cell interchanges are applied to a clustered circuit and subsequently to the original circuit. Numerical results demonstrate our two phase heuristic produces better partitions with less computational eeort than its one phase counterpart.
منابع مشابه
Multi Objective Inclined Planes System Optimization Algorithm for VLSI Circuit Partitioning
In this paper multi objective optimization problem for partitioning process of VLSI circuit optimization is solved using IPO algorithm. The methodology used in this paper is based upon the dynamic of sliding motion along a frictionless inclined plane. In this work, modules and elements of the circuit are divided into two smaller parts (components) in order to minimize the cutsize and area imbal...
متن کاملBalanced multi-level multi-way partitioning of analog integrated circuits for hierarchical symbolic analysis
This paper considers the problem of partitioning analog integrated circuits for hierarchical symbolic analysis based on determinant decision diagrams (DDDs). The objective is to use DDDs with the minimum number of vertices to represent all the symbolic expressions. We show that the problem can be formulated as that of multi-level multi-way hyper graph partitioning with balance constraints, and ...
متن کاملSpectral Partitioning with Multiple Eigenvectors
The gvuph partitioning problem is to divide the vertices of a graph into disjoint clusters to minimize the total cost of the edges cut by the clusters. A spectral partitioning heuristic uses the graph’s eigenvectors to construct a geometric representation of the graph (e.g., linear orderings) which are subsequently partitioned. Our main result shows that when all the eigenvectors are used, grap...
متن کاملTiming Driven Multi-FPGA Board Partitioning
System level design is increasingly turning towards FPGAs to take advantage of their low cost and fast prototyping. In this paper we present a timing driven partitioning approach for architecturally constrained reconngurable multi-FPGA systems. The partitioning approach using a Path-based clustering based on the attraction function proposed by Kahng et.al 19] followed by FM based min-cut partit...
متن کاملTutorial on VLSI Partitioning
The tutorial introduces the partitioning with applications to VLSI circuit designs. The problem formulations include two-way, multiway, and multi-level partitioning, partitioning with replication, and performance driven partitioning. We depict the models of multiple pin nets for the partitioning processes. To derive the optimum solutions, we describe the branch and bound method and the dynamic ...
متن کامل